Distributed robust adaptive equilibrium computation for generalized convex games
نویسندگان
چکیده
منابع مشابه
Distributed robust adaptive equilibrium computation for generalized convex games
This paper considers a class of generalized convex games where each player is associated with a convex objective function, a convex inequality constraint and a convex constraint set. The players aim to compute a Nash equilibrium through communicating with neighboring players. The particular challenge we consider is that the component functions are unknown a priori to associated players. We stud...
متن کاملEquilibrium Computation for Extensive Games
This thesis studies equilibrium computation algorithms for extensive games. We focus on the enumeration of Nash equilibria and on the computation of an extensive form correlated equilibrium. The contribution of this thesis consists of two parts. First, we study an algorithm for enumerating all Nash equilibria of a two-player extensive game. This algorithm is based on the sequence form descripti...
متن کاملGeneralized Convex Games
Economists have long argued that the existence of increasing returns to scale or unique complementary inputs may lead to indeterminacy in how the gains to team production are shared among team members. Cooperative games provide a framework in which to formalize and explore this intuition. In games with side payments, the notion of a convex game introduced by Shapley (1971) provides a natural wa...
متن کاملFast Equilibrium Computation for Infinitely Repeated Games
It is known that an equilibrium of an infinitely repeated two-player game (with limit average payoffs) can be computed in polynomial time, as follows: according to the folk theorem, we compute minimax strategies for both players to calculate the punishment values, and subsequently find a mixture over outcomes that exceeds these punishment values. However, for very large games, even computing mi...
متن کاملFinding Normalized Equilibrium in Convex-concave Games
This paper considers a fairly large class of noncooperative games in which strategies are jointly constrained. When what is called the Ky Fan or Nikaidô-Isoda function is convex-concave, selected Nash equilibria correspond to diagonal saddle points of that function. This feature is exploited to design computational algorithms for finding such equilibria. To comply with some freedom of individua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2016
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2015.10.012